On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
نویسندگان
چکیده
In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the art, defeasible logic implementation to handle all such variants of defeasible logic.
منابع مشابه
Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics
The most recent version of defeasible logic (Nute, 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs using a simple scheme proposed in (Brewka, 2001). It is found that by introducing ambiguity propagation into this logic, the assertions of defeasible theories coincide with the well-founded models of their logic program translations. Wit...
متن کاملInterdefinability of defeasible logic and logic programming under the well-founded semantics
We provide a method of translating theories of Nute’s defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalis...
متن کاملOn the Relationship between Defeasible Logic and Well-Founded Semantics
We investigate in this paper the relationship between an ambiguity propagating defeasible logic recently proposed by Antoniou et al. 3] and well-founded semantics with priorities 6] under a straightforward translation from defeasible theories to extended logic programs. It turns out that a slightly restricted version of defeasible logic is correct wrt well-founded semantics yet incomplete. We a...
متن کاملRelating Defeasible Logic to the Well-Founded Semantics for Normal Logic Programs
The most recent version of defeasible logic (Nute 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs. A correspondence is shown between the assertions of a defeasible theory and the literals contained in the well-founded model of the translation. The translation scheme is based upon (Antoniou & Maher 2002) but is modified to account for ...
متن کاملDR-Prolog: A System for Reasoning with Rules and Ontologies on the Semantic Web
The development of the Semantic Web [Berners Lee et al., 2001] proceeds in layers, each layer being on top of the others. At present, the highest layer that has reached sufficient maturity is the ontology layer in the form of the description logic based languages, DAML+OIL and OWL. The next step in the development of the Semantic Web will be the logic and proof layers. Rule systems can play a t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010